Path decomposition - PDFSEARCH.IO - Document Search Engine

Path decomposition
Results: 318

#	Item
51	The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number ? Michael Fellows1,2 and Frances Rosamond1 Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:12:58 NP-complete problems Analysis of algorithms Parameterized complexity Kernelization Bidimensionality Dominating set Tree decomposition Path decomposition Feedback vertex set Theoretical computer science Computational complexity theory Graph theory
52	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Grid Proximity Graphs: LOGs, GIGs and GIRLs River Allen∗ Laurie Heyer† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:57 Tree Directed acyclic graph Planar graph Degree Path decomposition Graph coloring Graph theory Graph Vertex
53	Crossing-Number Critical Graphs have Bounded Path-width Petr Hlinˇ en´ y? School of Mathematical and Computing Sciences, Add to Reading List Source URL: www.fi.muni.cz Language: English - Date: 2005-02-11 15:58:00 Tree Graph property Induced path Minor Graph Planar graph End Mycielskian Line graph Graph theory Path decomposition Crossing number
54	The min-# problem, a hybrid error criterion for near-linear time performance Lilian Buzer∗† Abstract 2.1 Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2005-07-31 13:55:46 Network theory Shortest path problem NP-complete problems Connectivity Euclidean plane geometry Analysis of algorithms Path decomposition Minimum spanning tree Theoretical computer science Computational complexity theory Mathematics
55	ELSEVIER Information Processing Letters Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:07:31 Tree decomposition Robertson–Seymour theorem Minor Chordal graph Tree Graph Planar graphs Degeneracy Clique-sum Graph theory Path decomposition Graph operations
56	Tackling the Partner Units Configuration Problem∗ Markus Aschinger, Conrad Drescher, Georg Gottlob, Peter Jeavons, Evgenij Thorstensen Computing Laboratory University of Oxford Add to Reading List Source URL: www.cs.ox.ac.uk Language: English - Date: 2013-06-06 21:34:43 Graph operations Tree decomposition Connectivity Path decomposition Decomposition method Nondeterministic algorithm Connected component Tree Graph theory Theoretical computer science Mathematics
57	Discrete Mathematics–252 www.elsevier.com/locate/disc Forbidden minors to graphs with small feedback sets Michael J. Dinneena;∗ , Kevin Cattellb , Michael R. Fellowsb Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:07:31 Tree decomposition Robertson–Seymour theorem Minor Planar graphs Feedback vertex set Forbidden graph characterization Permutation graph Tree Graph Graph theory Graph operations Path decomposition
58	Non-Stretchable Pseudo-Visibility Graphs Ileana Streinu Dept. of Computer Science, Smith College, Northampton, MA 01063, USA. Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2003-06-20 15:59:40 Visibility graph Bipartite graph Matroid theory Path decomposition Intersection graph Graph theory Graph Planar graph
59	CCCG 2011, Toronto ON, August 10–12, 2011 Memory-Constrained Algorithms for Shortest Path Problems Tetsuo Asano∗ Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Network theory Routing algorithms Planar separator theorem Shortest path problem Distance Induced path Tree NP-complete problems Path decomposition Graph theory Mathematics Theoretical computer science
60	When Trees Grow Low: Shrubs and Fast MSO1 Robert Ganian1 , Petr Hlinˇen´ y2 , Jaroslav Neˇsetˇril3 , Jan Obdrˇz´alek2 , Patrice Ossona de Mendez4 , and Reshma Ramadurai2 1 Add to Reading List Source URL: www.fi.muni.cz Language: English - Date: 2012-06-17 02:27:41 NP-complete problems Cograph Tree decomposition Clique Graph Tree Minor Cycle rank Path decomposition Graph theory Graph operations Graph coloring